COPY-COLLECT: A new primitive for the Linda model
نویسندگان
چکیده
Linda is a model of communication for concurrent processes. This paper proposes the addition of a new primitive to the Linda model, called copy-collect. An informal semantics of the new primitive is presented and an outline of the multiple rd problem which provides the justi cation for adding a new primitive. A description of how the new primitive can be implemented on several di erent implementations is also provided.
منابع مشابه
Solving the Linda Multiple rd Problem Using the Copy-Collect Primitive
Linda is a mature coordination language that has been in use for several years. However as a result of recent work on the model we have found a simple class of operation that is widely used in many diierent algorithms which the Linda model is unable to express in a viable fashion. An example algorithm which uses this operation is the composition of two binary relations. By examining how to impl...
متن کاملSolving the LINDA Multiple rd Problem
Linda is a co-ordination language that has been used for many years. From our recent work on the model we have found a simple operation that is widely used in many di erent algorithms which the Linda model is unable to express in a viable fashion. We examine a function which performs the composition of two binary relations. By examining how to implement this in parallel using Linda we demonstra...
متن کاملBulk primitives in Linda run-time systems
This thesis investigates techniques for the efficient implementation of the Linda parallel process coordination model for open, distributed computing systems. The principal focus of the research is on the use of the bulk movement of tuples within open systems which, contrary to intuition, can result in significant efficiency gains for a large class of problems. The emphasis on open systems — th...
متن کاملGlobal synchronisation in Linda
This paper examines the \Distributed Summation" problem, and its solution in Linda. A number of problems with the current set of primitives are examined, and a new primitive , collect, is proposed.
متن کاملLinda Implementation Revisited
Linda is a model for communication and co-ordination of parallel processes. The model provides a virtual shared memory called tuple space, and primitives to place tuples into and remove tuples from tuple space. The style of programming provided by Linda is quite different to the style of, say, occam. We describe a new implementation of Linda across a network of transputers. We provide the four ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016